#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=2e2;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
char str[maxn];
bool one[maxn];
int main(void){
   cin.tie(0);std::ios::sync_with_stdio(false);
   LL t;cin>>t;
   while(t--){
      LL k;cin>>k;
      cin>>(str+1);
      LL times=0;
      while(1){
         LL add=0;
         memset(one,0,sizeof(one));
         for(LL i=1;i<k;i++){
             if(str[i]=='A'&&str[i+1]=='P'&&!one[i]&&!one[i+1]){
                str[i+1]='A';
                add++;
                one[i]=one[i+1]=true;
             }
         }
         if(!add) break;
         times++;
      }
      cout<<times<<"\n";
   }
   return 0;
}
